A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
نویسندگان
چکیده
منابع مشابه
A Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Disjointness
We prove that two-party randomized communication complexity satisfies a strong direct product property, so long as the communication lower bound is proved by a “corruption” or “one-sided discrepancy” method over a rectangular distribution. We use this to prove new n lower bounds for numberon-the-forehead protocols in which the first player speaks once and then the other two players proceed arbi...
متن کاملMultiparty Communication Complexity of Disjointness
We obtain a lower bound of n on the k-party randomized communication complexity of the Disjointness function in the ‘Number on the Forehead’ model of multiparty communication when k is a constant. For k = o(log logn), the bounds remain super-polylogarithmic i.e. (logn). The previous best lower bound for three players until recently was Ω(logn). Our bound separates the communication complexity c...
متن کاملSimplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/4). This gives the first lower bound that is linear in n, nearly matching Grolmusz’s upper bound of O(log(n) + kn/2). We also simplify Sherstov’s proof showing an Ω( √ n/(k2)) lower bound for the randomized communication complexity of set disjointness.
متن کاملA strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of J, Klauck and Nayak [JKN08], thereby our result implying their direct product result in terms of the two-way product subdistribution ...
متن کاملInformation Complexity for Multiparty Communication
In this paper, we have studied the information complexity for the communication model involving more than two parties. A lot of work has already been done on the information complexity in two party communication model and the question of extending the definition of information complexity to the multiparty communication model was posed in [Bra12]. In this paper, we first give a definition of int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2006
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-007-0220-2